Reasoning about cooperation, actions and preferences
نویسندگان
چکیده
منابع مشابه
Logics for Cooperation , Actions and Preferences
In this thesis, a logic for reasoning about cooperative ability, actions and preferences is developed. It is an extention of a cooperation logic with actions, developed by Sauro et al., which is a modular modal logic consisting of an environment module for reasoning about actions and their effects and an agents module for reasoning about the cooperative ability of agents to perform actions. In ...
متن کاملA Logic for Cooperation, Actions and Preferences
In this paper, a logic for reasoning about cooperation, actions and preferences of agents is developed. It is shown to be sound and complete and the satisfiability problem of its fragment that does not contain strict preferences is shown to be NExpTime-complete.
متن کاملReasoning about Intended Actions
In most research on reasoning about actions and reasoning about narratives one either reasons about hypothetical execution of actions, or about actions that actually occurred. In this paper we first develop a high level language that allows the expression of intended or planned action sequences. Unlike observed action occurrences, planned or intended action occurrences may not actually take pla...
متن کاملReasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permits the representation of concurrent activity. Suppose we have a set of abstract actions defined by Horn clauses from a set of basic actions. Let us assume that an abstract action ψ has occurred, and ask whether a given ...
متن کاملReasoning about Unreliable Actions
We analyse the philosopher Davidson’s semantics of actions, using a strongly typed logic with contexts given by sets of partial equations between the outcomes of actions. This provides a perspicuous and elegant treatment of reasoning about action, analogous to Reiter’s work on artificial intelligence. We define a sequent calculus for this logic, prove cut elimination, and give a semantics based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Synthese
سال: 2009
ISSN: 0039-7857,1573-0964
DOI: 10.1007/s11229-009-9551-7